Lower Bounding Edit Distances between Permutations
نویسندگان
چکیده
منابع مشابه
Lower bounding edit distances between permutations
A number of fields, including the study of genome rearrangements and the design of interconnection networks, deal with the connected problems of sorting permutations in as few moves as possible, using a given set of allowed operations, or computing the number of moves the sorting process requires, often referred to as the distance of the permutation. These operations often act on just one or tw...
متن کامل[hal-00826968, v1] Lower bounding edit distances between permutations
A number of fields, including the study of genome rearrangements and the design of interconnection networks, deal with the connected problems of sorting permutations in “as few moves as possible”, using a given set of allowed operations, or computing the number of moves the sorting process requires, often referred to as the distance of the permutation. These operations often act on just one or ...
متن کاملEdit Distances and Factorisations of Even Permutations
A number of fields, including genome rearrangements and interconnection network design, are concerned with sorting permutations in “as few moves as possible”, using a given set of allowed operations. These often act on just one or two segments of the permutation, e.g. by reversing one segment or exchanging two segments. The cycle graph of the permutation to sort is a fundamental tool in the the...
متن کاملStatistical Uses for Distances between Permutations
We present examples of cases where rankings are the natural output of multivariate rank reduction methods. For political data without including prior information about members position on the left -right spectrum we can use voting records to provide the underlying gradient. Ordination methods are the standard procedure for summarizing in archaelogy, psychometrics or ecology, where underlying gr...
متن کاملBounding Right-Arm Rotation Distances
Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/13090897x